The Optimal Relaxation Parameter for the SOR Method Applied to a Classical Model Problem
نویسندگان
چکیده
The successive overrelaxation (SOR) method is an example of a classical iterative method for the approximate solution of a system of linear equations. Its iteration matrix depends on a relaxation parameter. There is no explicit formula for the optimal relaxation parameter in terms of properties of the system matrix of a general system matrix. However, for the classical model problem of a finite difference approximation to the Poisson equation, a formula for the optimal relaxation parameter can be derived. Beyond this model problem, this result is also useful as guidance for the choice of the parameter in other problems. This paper presents the detailed derivation of the formula for the optimal relaxation parameter for the model problem and extends the well-known oneand two-dimensional results to higher dimensions.
منابع مشابه
The optimal relaxation parameter for the SOR method applied to the Poisson equation in any space dimensions
The finite difference discretization of the Poisson equation with Dirichlet boundary conditions leads to a large, sparse system of linear equations for the solution values at the interior mesh points. This problem is a popular and useful model problem for performance comparisons of iterative methods for the solution of linear systems. To use the successive overrelaxation (SOR) method in these c...
متن کاملOptimal Semi-Iterative Methods for Complex SOR with Results from Potential Theory
We consider the application of semi-iterative methods (SIM) to the standard (SOR) method with complex relaxation parameter ω, under the following two assumptions: (1) the associated Jacobi matrix J is consistently ordered and weakly cyclic of index 2, and (2) the spectrum σ(J ) of J belongs to a compact subset of the complex plane C, which is symmetric with respect to the origin. By using resul...
متن کاملOn the Successive Overrelaxation Method
Problem statement: A new variant of the Successive Overrelaxation (SOR) method for solving linear algebraic systems, the KSOR method was introduced. The treatment depends on the assumption that the current component can be used simultaneously in the evaluation in addition to the use the most recent calculated components as in the SOR method. Approach: Using the hidden explicit characterization ...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کامل